Homotopy method for minimum consumption orbit transfer problem
نویسندگان
چکیده
منابع مشابه
On the Maximal Orbit Transfer Problem
Assume that a spacecraft is in a circular orbit and consider the problem of finding the largest possible circular orbit to which the spacecraft can be transferred with constant thrust during a set time, so that the variable parameter is the thrust-direction angle β. Also assume that there is only one center of attraction at the common center of the two circular orbits. Finally, assume normalize...
متن کاملMETAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملFast Geometric Method for Calculating Accurate Minimum Orbit Intersection Distances
We present a new method to compute Minimum Orbit Intersection Distances (MOIDs) for arbitrary pairs of heliocentric orbits and compare it with Giovanni Gronchi’s algebraic method. Our procedure is numerical and iterative, and the MOID configuration is found by geometric scanning and tuning. A basic element is the meridional plane, used for initial scanning, which contains one of the objects and...
متن کاملThe Homotopy Orbit Spectrum for Profinite Groups
Let G be a pro nite group. We de ne an S[[G]]-module to be a G-spectrum X that satis es certain conditions, and, given an S[[G]]-module X, we de ne the homotopy orbit spectrum XhG. When G is countably based and X satis es a certain niteness condition, we construct a homotopy orbit spectral sequence whose E2-term is the continuous homology of G with coefcients in the graded pro nite b Z[[G]]-mod...
متن کاملOptimization problem in multi-homogeneous homotopy method
Multi-homogeneous homotopy continuation method is one of the most efficient approaches in solving all isolated solutions of a polynomial system of equations. Finding the optimal partition of variables with the minimal multihomogeneous Bézout number is clearly an optimization problem. Multi-homogeneous continuation using the optimal partition of variables reduces the computational cost in path t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Control, Optimisation and Calculus of Variations
سال: 2006
ISSN: 1292-8119,1262-3377
DOI: 10.1051/cocv:2006003